Formal Safety Net Control Using Backward Reachability Analysis

Colored Petri Net inversion for Backward Reachability Analysis

Colored Petri Nets (CPN) are a powerful, recognized and intuitive modelling tool. They allow a precise representation of distributed, embedded and/or real time systems. These models can be then used among others for the dependability assessment. This paper develops a new method of CPN analysis called the Backward reachability. It provides information about different ways of reaching a particula...

Reachability Analysis Using Net Unfoldings

Intertwined Forward-Backward Reachability Analysis Using Interpolants

In this work we develop a novel SAT-based verification approach which is based on interpolation. The novelty of our approach is in extracting interpolants in both forward and backward manner and exploiting them for an intertwined approximated forward and backward reachability analysis. Our approach is also mostly local and avoids unrolling of the checked model as much as possible. This results ...

Comparing Forward and Backward Reachability as Tools for Safety Analysis

Using only the existence and uniqueness of trajectories for a generic dynamic system with inputs, we de ne and examine eight types of forward and backward reachability constructs. If the input is treated in a worst-case fashion, any forward or backward reach set or tube can be used for safety analysis, but if the input is treated in a best-case fashion only the backward reach tube always provid...

Backward Reachability Analysis of Colored Petri Nets

This paper deals with a formal method for the study of the backward reachability analysis applied on Colored Petri Nets (CPN). The proposed method proceeds in two steps : 1) it translates CPN to terms of the Multiplicative Intuitionistic Linear Logic (MILL); 2) it proves sequents by constructing proof trees. The translation from CPN to MILL must respect some properties such as the semantic asso...